Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance

نویسنده

  • Nikolai Krivulin
چکیده

We consider a constrained minimax single-facility location problem with addends on the plane with rectilinear distance. The problem is first formulated in a standard form, and then represented in terms of tropical mathematics as a constrained optimization problem. We apply methods and results of tropical optimization to obtain direct, explicit solutions to the optimization problem. The results obtained are used to derive solutions of the location problem, and of its special cases with reduced sets of constraints, in a closed form, ready for immediate computation. Numerical solutions of example problems are given, and graphical illustrations are presented. Key-Words: minimax location problem, rectilinear distance, idempotent semifield, tropical optimization, explicit solution. MSC (2010): 65K10, 15A80, 90B85, 65K05, 90C48

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Solution of a Constrained Tropical Optimization Problem with Application to Location Analysis

We present a multidimensional optimization problem that is formulated and solved in the tropical mathematics setting. The problem consists in minimizing a nonlinear objective function defined on vectors in a finite-dimensional semimodule over an idempotent semifield by means of a conjugate transposition operator, subject to the constraints in the form of linear vector inequalities. A complete d...

متن کامل

Solving single facility goal Weber location problem using stochastic optimization methods

Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...

متن کامل

Single Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions

Location theory is an interstice field of optimization and operations research‎. ‎In the classic location models‎, ‎the goal is finding the location of one or more facilities such that some criteria such as transportation cost‎, ‎the sum of distances passed by clients‎, ‎total service time, and cost of servicing are minimized‎. ‎The goal Weber location problem is a special case of location mode...

متن کامل

Mixed planar and network single-facility location problems

We consider the problem of optimally locating a single facility anywhere in a network to serve both on-network and off-network demands. Off-network demands occur in a Euclidean plane, while on-network demands are restricted to a network embedded in the plane. On-network demand points are serviced using shortest-path distances through links of the network (e.g., on-road travel), whereas demand p...

متن کامل

Algebraic solutions to multidimensional minimax location problems with Chebyshev distance

Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is given. The solution reduces both unconstrained and constrained location problems to evaluation of the eigenvalue and eigenvectors of an appropriate matrix. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Manag. Science

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2017